منابع مشابه
Weighted Hamming Metric Structures
A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct ...
متن کاملHamming Distance Metric Learning
Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...
متن کاملClass of Binary Generalized Goppa Codes Perfect in Weighted Hamming Metric
The class of the binary generalized Goppa codes is offered. It is shown that the codes of this class are on the Hamming bound constructed for a weighted metric.
متن کاملThe Digital Fingerprinting Method for Static Images Based on Weighted Hamming Metric and on Weighted Container Model
The algorithm of fingerprint constructing for still images based on weighted image structure model is proposed. The error correcting codes that are perfect in weighted Hamming metric are used as a base for fingerprint constructing.
متن کاملAhlswede–Khachatrian Theorems: Weighted, Infinite, and Hamming
The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of a k-uniform t-intersecting family on n points, and describes all optimal families. We extend this theorem to several other settings: the weighted case, the case of infinitely many points, and the Hamming scheme. The weighted Ahlswede–Khachatrian theorem gives the maximal μp measure of a t-inte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2018.08.006